Approximate Subgraph Isomorphism for Image Localization

نویسندگان

  • Vaishaal Shankar
  • Jordan Zhang
  • Jerry Chen
  • Christopher Dinh
  • Matthew Clements
  • Avideh Zakhor
چکیده

We propose a system for user-aided image localization in urban regions by exploiting the inherent graph like structure of urban streets, buildings and intersections. In this graph the nodes represent buildings, intersections and roads. The edges represent “logical links” such as two buildings being next to each other, or a building being on a road. We generate this graph automatically for large areas using publicly available road and building footprint data. To localize a query image, a user generates a similar graph manually by identifying the buildings, intersections and roads in the image. We then run a subgraph isomorphism algorithm to find candidate locations for the the query image. We evaluate our system on regions of multiple sizes ranging from 2km to 47km in the Amman,Jordan and Berkeley,CA,USA. We have found that in many cases we reduce the uncertainty in the query’s location by as much as 90 percent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Ontology Method of Learning Resource based on the Approximate Subgraph Isomorphism

Digital learning resource ontology is often based on different specification building. It is hard to find resources by linguistic ontology matching method. The existing structural matching method fails to solve the problem of calculation of structural similarity well. For the heterogeneity problem among learning resource ontology, an algorithm is presented based on subgraph approximate isomorph...

متن کامل

LeRP: An Algorithm Using Length-R Paths To Determine Subgraph Isomorphism

The ‘LeRP’ algorithm determines subgraph isomorphism for attributed graphs based on counts of Length-R Paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The paradigm associated with the LeRP algorithm differs fundamentally from other approaches. When comparing structural similarity it uses a neighborhood of nodes, which varies in size dynamically. This appro...

متن کامل

Localization of Sparse Sensor Networks Using Layout Information

Localization is the process by which sensor networks associate spatial position information with individual sensors’ measurements. While manual surveying is sufficient for small-scale prototypes, it is too time-consuming and costly for the large-scale deployments anticipated in the near future. Our experiments with medium-scale outdoor sensor network deployments show that sparsity of ranging me...

متن کامل

Neighbor-Aware Search for Approximate Labeled Graph Matching using the Chi-Square Statistics

Labeled graphs provide a natural way of representing entities, relationships and structures within real datasets such as knowledge graphs and protein interactions. Applications such as question answering, semantic search, and motif discovery entail efficient approaches for subgraph matching involving both label and structural similarities. Given the NP-completeness of subgraph isomorphism and t...

متن کامل

Recognizing Objects Using Color-Annotated Adjacency Graphs

We introduce a new algorithm for identifying objects in cluttered images, based on approximate subgraph matching. This algorithm is robust under moderate variations in the camera viewpoints. In other words, it is expected to recognize an object (whose model is derived from a template image) in a search image, even when the cameras of the template and search images are substantially different. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016